Selberg Sieve
   HOME

TheInfoList



OR:

In
number theory Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic function, integer-valued functions. German mathematician Carl Friedrich Gauss (1777â ...
, the Selberg sieve is a technique for estimating the size of "sifted sets" of
positive integer In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and ordering (as in "this is the ''third'' largest city in the country"). Numbers used for counting are called ''cardinal n ...
s which satisfy a set of conditions which are expressed by congruences. It was developed by
Atle Selberg Atle Selberg (14 June 1917 – 6 August 2007) was a Norwegian mathematician known for his work in analytic number theory and the theory of automorphic forms, and in particular for bringing them into relation with spectral theory. He was awarded t ...
in the 1940s.


Description

In terms of
sieve theory Sieve theory is a set of general techniques in number theory, designed to count, or more realistically to estimate the size of, sifted sets of integers. The prototypical example of a sifted set is the set of prime numbers up to some prescribed lim ...
the Selberg sieve is of ''combinatorial type'': that is, derives from a careful use of the
inclusion–exclusion principle In combinatorics, a branch of mathematics, the inclusion–exclusion principle is a counting technique which generalizes the familiar method of obtaining the number of elements in the union of two finite sets; symbolically expressed as : , A \cup ...
. Selberg replaced the values of the
Möbius function The Möbius function is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated ''Moebius'') in 1832. It is ubiquitous in elementary and analytic number theory and most oft ...
which arise in this by a system of weights which are then optimised to fit the given problem. The result gives an ''upper bound'' for the size of the sifted set. Let A be a set of positive integers \le x and let P be a set of primes. Let A_d denote the set of elements of A divisible by d when d is a product of distinct primes from P. Further let A_1 denote A itself. Let z be a positive real number and P(z) denote the product of the primes in P which are \le z. The object of the sieve is to estimate :S(A,P,z) = \left\vert A \setminus \bigcup_ A_p \right\vert . We assume that , ''A''''d'', may be estimated by : \left\vert A_d \right\vert = \frac X + R_d . where ''f'' is a
multiplicative function In number theory, a multiplicative function is an arithmetic function ''f''(''n'') of a positive integer ''n'' with the property that ''f''(1) = 1 and f(ab) = f(a)f(b) whenever ''a'' and ''b'' are coprime. An arithmetic function ''f''(''n'') is ...
and ''X''   =   , ''A'', . Let the function ''g'' be obtained from ''f'' by
Möbius inversion Moebius, Möbius or Mobius may refer to: People * August Ferdinand Möbius (1790–1868), German mathematician and astronomer * Theodor Möbius (1821–1890), German philologist * Karl Möbius (1825–1908), German zoologist and ecologist * Paul ...
, that is : g(n) = \sum_ \mu(d) f(n/d) : f(n) = \sum_ g(d) where μ is the
Möbius function The Möbius function is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated ''Moebius'') in 1832. It is ubiquitous in elementary and analytic number theory and most oft ...
. Put : V(z) = \sum_ \frac. Then : S(A,P,z) \le \frac + O\left( \right) where _1,d_2/math> denotes the
least common multiple In arithmetic and number theory, the least common multiple, lowest common multiple, or smallest common multiple of two integers ''a'' and ''b'', usually denoted by lcm(''a'', ''b''), is the smallest positive integer that is divisible by bot ...
of d_1 and d_2. It is often useful to estimate V(z) by the bound : V(z) \ge \sum_ \frac . \,


Applications

* The
Brun–Titchmarsh theorem In analytic number theory, the Brun–Titchmarsh theorem, named after Viggo Brun and Edward Charles Titchmarsh, is an upper bound on the distribution of prime numbers in arithmetic progression. Statement Let \pi(x;q,a) count the number of prime ...
on the number of
primes in arithmetic progression In number theory, primes in arithmetic progression are any sequence of at least three prime numbers that are consecutive terms in an arithmetic progression. An example is the sequence of primes (3, 7, 11), which is given by a_n = 3 + 4n for 0 \le n ...
; * The number of ''n'' ≤ ''x'' such that ''n'' is
coprime In mathematics, two integers and are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides does not divide , and vice versa. This is equivale ...
to φ(''n'') is asymptotic to e−γ ''x'' / log log log (''x'') .


References

* * * * * * {{cite journal , first=Atle , last=Selberg , authorlink=Atle Selberg , title=On an elementary method in the theory of primes , journal=Norske Vid. Selsk. Forh. Trondheim , volume=19 , year=1947 , pages=64–67 , zbl=0041.01903 , issn=0368-6302 Sieve theory